Rank two Breuil modules: Basic structures
نویسندگان
چکیده
منابع مشابه
Breuil Modules for Raynaud Schemes
Let p be an odd prime, and let OK be the ring of integers in a finite extension K/Qp. Breuil has classified finite flat group schemes of type (p, . . . , p) over OK in terms of linear-algebraic objects that have come to be known as Breuil modules. This classification can be extended to the case of finite flat vector space schemes G over OK . When G has rank one, the generic fiber of G correspon...
متن کاملOn the Torsion of Drinfeld Modules of Rank Two
We prove that the curve Y0(p) has no F2(T )-rational points where p ⊳ F2[T ] is a prime ideal of degree at least 3 and Y0(p) is the affine Drinfeld modular curve parameterizing Drinfeld modules of rank two over F2[T ] of general characteristic with Hecke-type level p-structure. As a consequence we derive a conjecture of Schweizer describing completely the torsion of Drinfeld modules of rank two...
متن کاملSymmetries of Flat Rank Two Distributions and Sub-riemannian Structures
Flat sub-Riemannian structures are local approximations — nilpotentizations — of sub-Riemannian structures at regular points. Lie algebras of symmetries of flat maximal growth distributions and sub-Riemannian structures of rank two are computed in dimensions 3, 4, and 5. 1. Sub-Riemannian structures A sub-Riemannian geometry is a triple (M,∆, 〈·, ·〉), where M is a smooth manifold, ∆ ⊂ TM is a s...
متن کاملRank-one Drinfeld Modules on Elliptic Curves
The sgn-normalized rank-one Drinfeld modules 4> associated with all elliptic curves E over ¥q for 4 < q < 13 are computed in explicit form. (Such 4> for q < 4 were computed previously.) These computations verify a conjecture of Dormán on the norm of j{) = aq+l and also suggest some interesting new properties of . We prove Dorman's conjecture in the ramified case. We also prove the formula...
متن کاملRank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + l) time, where t(n) is the cost of traversing the structure and l ≤ n is the number of reported items satisfying the query. In this paper we focus on rank-sensitive data structures, which are additionally given a ranking of the n items, so that just t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2012
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2012.04.018